co-rank: An Online Tool for Collectively Deciding Efficient Rankings Among Peers
نویسندگان
چکیده
The rationale of co-rank • The co-rank tool is designed to facilitate the grading process in Massive Open Online Courses (MOOCs). • Goal: implement an efficient grading system to evaluate the performance of the students. • Problem: the number of students attending a course is huge, while the number of available professional graders is limited. • Suggestion: peer grading; each student acts as a grader as well and is responsible of assessing a small number of other exam papers. • The co-rank tool implements ordinal peer grading-like techniques.
منابع مشابه
Collection and Rank Aggregation
Despite the substantial literature on recommendation systems, there have been few studies in distributed settings, where peers provide recommendations locally. Motivated by word of mouth type of social behavior and the advantages of sharing resources, we analyze an online distributed recommendation system with joint content collection and rank aggregation. In such a system, peers contact each o...
متن کاملOnline Learning to Rank: Absolute vs. Relative
Online learning to rank holds great promise for learning personalized search result rankings. First algorithms have been proposed, namely absolute feedback approaches, based on contextual bandits learning; and relative feedback approaches, based on gradient methods and inferred preferences between complete result rankings. Both types of approaches have shown promise, but they have not previousl...
متن کاملThe University Rankings Game: Modeling the Competition Among Universities for Ranking
With university rankings gaining both in popularity and influence, university administrators develop strategies to improve their rankings. To better understand this competition for ranking, we present an adjacent category logit model to address the localized nature of ranking competition and include lagged rank as an independent variable to account for stickiness of ranking. Calibrating our mod...
متن کاملOnline Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach
We study the problem of online rank elicitation, assuming that rankings of a set of alternatives obey the Plackett-Luce distribution. Following the setting of the dueling bandits problem, the learner is allowed to query pairwise comparisons between alternatives, i.e., to sample pairwise marginals of the distribution in an online fashion. Using this information, the learner seeks to reliably pre...
متن کاملRanking Operations Management Conferences
Several publications have appeared in the field of Operations Management which rank Operations Management related journals. Several ranking systems exist for journals based on , for example, perceived relevance and quality, citation, and author affiliation. Many academics also publish at conferences but we have not come across publications that rank conferences. Conference rankings are generall...
متن کامل